Dialog act tagging with support vector machines and hidden Markov models
نویسندگان
چکیده
We use a combination of linear support vector machines and hidden markov models for dialog act tagging in the HCRC MapTask corpus, and obtain better results than those previously reported. Support vector machines allow easy integration of sparse highdimensional text features and dense low-dimensional acoustic features, and produce posterior probabilities usable by sequence labelling algorithms. The relative contribution of text and acoustic features for each class of dialog act is analyzed.
منابع مشابه
Using Context Information for Dialog Act Classification in DNN Framework
Previous work on dialog act (DA) classification has investigated different methods, such as hidden Markov models, maximum entropy, conditional random fields, graphical models, and support vector machines. A few recent studies explored using deep learning neural networks for DA classification, however, it is not clear yet what is the best method for using dialog context or DA sequential informat...
متن کاملUsing SVM and Error-correcting Codes for M Meeting Cor
Accurate classification of dialog acts (DAs) is important for many spoken language applications. Different methods have been proposed such as hidden Markov models (HMM), maximum entropy (Maxent), graphical models, and support vector machines (SVMs). In this paper, we investigate using SVMs for multiclass DA classification in the ICSI meeting corpus. We evaluate (1) representing DA tagging direc...
متن کاملExploiting Support Vector Machines for Speaker Verifi
Hidden Markov Models have been proved to be an efficient way for statistically modeling sequence signals. And the Support Vector Machines seem to be a promising candidate to perform the classification task. A new method combining support vector machine and hidden Markov models is proposed. The output of support vector machines are modified as posterior probability using sigmoid function, and ac...
متن کاملHidden Markov Support Vector Machines
This paper presents a novel discriminative learning technique for label sequences based on a combination of the two most successful learning algorithms, Support Vector Machines and Hidden Markov Models which we call Hidden Markov Support Vector Machine. The proposed architecture handles dependencies between neighboring labels using Viterbi decoding. In contrast to standard HMM training, the lea...
متن کاملAutomatic Dialog Act Labeling with Minimal Supervision
ABSTRACT: For many natural language applications it is desirable to be able to automatically tag utterances according to their discourse function (dialog act), such as statement, question or acknowledgment. We investigate the problem of automatically tagging dialog acts when handlabeled training data is scarce. The tagging paradigm employed is a hidden Markov model in which dialog acts are stat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006